Bivariate Polynomial Codes for Secure Distributed Matrix Multiplication

We consider the problem of secure distributed matrix multiplication (SDMM). Coded computation has been shown to be an effective solution in multiplication, both providing privacy against workers and boosting speed by efficiently mitigating stragglers. In this work, we present a non-direct extension recently introduced bivariate polynomial codes. Bivariate codes have able further up exploiting partial work done stragglers rather than completely ignoring them while reducing upload communication cost and/or workers’ storage’s capacity needs. show that, especially for or storage constrained settings, proposed approach reduces average time SDMM compared its competitors literature.